COMPUTING SCIENCE A Read-Write-Validate Approach to Optimistic Concurrency Control for Energy Efficiency of Resource-Constrained Systems
نویسندگان
چکیده
Modern smartphones feature multiple applications which access shared data on the solid state storage within the device. As applications become more complex, contention over this memory resource is becoming an issue. This leads to increased battery drain as the applications are forced to touch the solid state device repeatedly after failing to retrieve or store data due to contention from other applications. We describe an optimistic concurrency control algorithm, combining a novel Read-WriteValidate phase sequence with virtual execution. The protocol is suitable for governing transactions operating on databases residing on resource-constrained devices. Increasing energy efficiency and reducing latency are primary goals for our algorithm. We show that this is achieved by reducing persistent store access, and satisfy realtime requirements via transaction scheduling that affords greater determinism. © 2013 Newcastle University. Printed and published by Newcastle University, Computing Science, Claremont Tower, Claremont Road, Newcastle upon Tyne, NE1 7RU, England. Bibliographical details SOLAIMAN, K., BROOK, M., USHAW, G., MORGAN, G. A Read-Write-Validate Approach to Optimistic Concurrency Control for Energy Efficiency of ResourceConstrained Systems [By] K. Solaiman, M. Brook, G. Ushaw, G. Morgan Newcastle upon Tyne: Newcastle University: Computing Science, 2013. (Newcastle University, Computing Science, Technical Report Series, No. CS-TR-1388)
منابع مشابه
Distributed Optimistic Concurrency Considered Optimistic
Optimistic concurrency relies on speculative execution, read-write conflict detection, and checkpointrollback techniques to provide a programming model that replaces locks with the abstraction of atomic, isolated execution of critical sections. Previous research has shown that on chip multi-processors, a class of workloads featuring irregular parallelism and rare read-write conflicts can reap s...
متن کاملA Distributed Architecture for Transactions Synchronization in Distributed Database Systems
Various concurrency control algorithms have been proposed for use in distributed database systems. But, the number of algorithms available for the distributed concurrency control, come into one of three basic classes: locking algorithms, Timestamp algorithms and optimistic (or certification) algorithms. In this paper we are presenting a Distributed Transaction Processing Model and an approach f...
متن کاملObservations on optimistic concurrency control schemes
Attstraet-Gptimistic concurrency control schemes allow uncontrolled access to shared data objects during transaction processing under the explicit assumption that read and write coticts among transactions are rare events. Before a transaction commits, the DBMS has to validate that no conflict has occurred Conflict resolution mainly relies on transaction abort. Two different optimistic concurren...
متن کاملA Genetic Based Resource Management Algorithm Considering Energy Efficiency in Cloud Computing Systems
Cloud computing is a result of the continuing progress made in the areas of hardware, technologies related to the Internet, distributed computing and automated management. The Increasing demand has led to an increase in services resulting in the establishment of large-scale computing and data centers, in addition to high operating costs and huge amounts of electrical power consumption. Insuffic...
متن کاملSerializable Snapshot Isolation in Shared-Nothing, Distributed Database Management Systems
NoSQL data storage systems provide high scalability and availability in exchange for limited transactional guarantees. In many cases, however, an application cannot give up transactional support but still needs the scalability provided by such systems. One approach for overcoming this limitation is to implement Snapshot Isolation (SI) on top of these systems. SI prevents most non-serializable e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013